# class MyCircularQueue:
#
#     def __init__(self, k: int):
#         """
#         Initialize your data structure here. Set the size of the queue to be k.
#         """
#
#         self.queue = [""] * k
#         self.max_length = k
#         self.start = -1
#         self.end = -1
#
#     def enQueue(self, value: int) -> bool:
#         """
#         Insert an element into the circular queue. Return true if the operation is successful.
#         """
#
#         if not self.isFull():
#             if self.start == -1:
#                 self.start = 0
#             self.end = (self.end + 1) % self.max_length
#             self.queue[self.end] = value
#             return True
#         else:
#             return False
#
#     def deQueue(self) -> bool:
#         """
#         Delete an element from the circular queue. Return true if the operation is successful.
#         """
#         if not self.isEmpty():
#             if self.start == self.end:  # the last element
#                 self.start, self.end = -1, -1
#                 # self.end = -1
#             else:
#                 self.start = (self.start + 1) % self.max_length
#             return True
#         else:
#             return False
#
#     def Front(self) -> int:
#         """
#         Get the front item from the queue.
#         """
#
#         return -1 if self.isEmpty() else self.queue[self.start]
#
#     def Rear(self) -> int:
#         """
#         Get the last item from the queue.
#         """
#         return -1 if self.isEmpty() else self.queue[self.end]
#
#     def isEmpty(self) -> bool:
#         """
#         Checks whether the circular queue is empty or not.
#         """
#
#         return self.start == -1 and self.end == -1
#
#     def isFull(self) -> bool:
#         """
#         Checks whether the circular queue is full or not.
#         """
#
#         return (self.end + 1) % self.max_length == self.start
#
#
# obj = MyCircularQueue(3)
# param_1 = obj.enQueue(3)
# param_2 = obj.deQueue()
# param_3 = obj.Front()
# param_4 = obj.Rear()
# param_5 = obj.isEmpty()
# param_6 = obj.isFull()

# # x = -1230000
# # # a = 9646324351 - 2**31 -1
# # # print(a.bit_length())
# # import collections
# # s = "aadadaadc"
# # # m = -1
# # # # for i,j in enumerate(s[:-1]):
# # # #     if j not in s[i+1:]:
# # # #         m = i
# # # #         break
# # # # print(m)
# # count = collections.Counter(s)
# # print(count)

# s = "anagram"
# t = "nagaram"
# if len(s) != len(t):
#     print(False)
# d = {}
# for i in s:
#     if i in d:
#         d[i] += 1
#     else:
#         d[i] = 1
# for j in t:
#     if j in d:
#         d[j] -= 1
#         if d[j] == 0:
#             d.pop(j)
#     else:
#         print(False)


# import re
# s = "A man, a plan, a canal: Panama"
# s1 = filter(str.isalnum,s)
# s2 = "".join(s1)
# print(s2)

# s2 = re.sub(r'\W+', '', s)
# s1 = "".join(re.findall("[A-Za-z0-9]",s))
# s1 = s1.lower()
# print(s1)
# print(s2)
# print(s1==s1[::-1])
# class Solution:
#     def isPalindrome(s: str) :
#         i, j = 0, len(s) - 1
#         while i < j:
#             while i < len(s) and not s[i].isalnum():
#                 i += 1
#             while j > -1 and not s[j].isalnum():
#                 j -= 1
#             if i > j:
#                 return True
#             if s[i].upper() != s[j].upper():
#                 return False
#             else:
#                 i += 1
#                 j -= 1
#         return True
# if __name__ == '__main__':
#     s = "A man, a plan, a canal: Panama"
#     a = Solution.isPalindrome(s)
#     print(a)

s = " -42"
s = s.strip()
print(s)
if 48 <= ord(s[0]) <= 57 or s[0] == "-" or s[0] == "+":
    pass
else:
    print(0)
